On the relaxation polytope of the linear ordering problem
نویسنده
چکیده
In the paper we investigate the linear ordering polytope P n. We consider the 3-dicycle relaxation polytope B n and give an example of a fractional vertex of B n such that all non-integral values of the vertex are not equal to 1=2. In this paper also we present a constructive operation (5-Extension) for generating new facets of the linear ordering polytope P n. By connecting MM obius ladders with special digraphs 5-Extension generates new facet-deening digraphs to which we can apply 5-Extension repeatedly.
منابع مشابه
A Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملNew semidefinite programming relaxations for the Linear Ordering and the Traveling Salesman Problem
In 2004 Newman [43] suggested a semidefinite programming relaxation for the Linear Ordering Problem (LOP) that is related to the semidefinite program used in the Goemans-Williamson algorithm to approximate the Max Cut problem [22]. Her model is based on the observation that linear orderings can be fully described by a series of cuts. Newman [43] shows that her relaxation seems better suited for...
متن کاملThe Strongest Facets of the Acyclic Subgraph Polytope Are Unknown
Abstrac t . We consider the acyclic subgraph polytope and define the notion of strength of a relaxation as the maximum improvement obtained by using this relaxation instead of the most trivial relaxation of the problem. We show that the strength of a relaxation is the maximum of the strengths of the relaxations obtained by simply adding to the trivial relaxation each valid inequality separately...
متن کاملA revisit of a mathematical model for solving fully fuzzy linear programming problem with trapezoidal fuzzy numbers
In this paper fully fuzzy linear programming (FFLP) problem with both equality and inequality constraints is considered where all the parameters and decision variables are represented by non-negative trapezoidal fuzzy numbers. According to the current approach, the FFLP problem with equality constraints first is converted into a multi–objective linear programming (MOLP) problem with crisp const...
متن کاملA Lagrangian relaxation approach to the edge-weighted clique problem
The b-clique polytope CP b is the convex hull of the node and edge incidence vectors of all subcliques of size at most b of a complete graph on n nodes. Including the Boolean quadric polytope QP as a special case and being closely related to the quadratic knapsack polytope, it has received considerable attention in the literature. In particular, the max-cut problem is equivalent with optimizing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007